OKA′S EXTRA ZERO PROBLEM AND APPLICATION

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Oka ’ s extra - zero problem by M . Abe

After the solution of Cousin II problem by K. Oka III in 1939, he thought an extra-zero problem in 1945 (his posthumous paper) asking if it is possible to solve an arbitrarily given Cousin II problem adding some extra-zeros whose support is disjoint from the given one. By the secondly named author, some special case was affirmatively confirmed in dimension two and a counter-example in dimension...

متن کامل

Extra Dimensions and the strong CP problem.

In higher dimensional theories, such as brane world models with quasilocalized non-Abelian gauge fields, the vacuum structure turns out to be trivial. Since the gauge theory behaves at large distances as a 4 + delta dimensional, thus the topology of the infinity is that of S(3+delta) rather than S(3). This topology does not support finite action instantonic configurations and thus the CP violat...

متن کامل

Control Problem and its Application in Management and Economic

The control problem and Dynamic programming is a powerful tool in economics and management. We review the dynamic programming problem from its beginning up to its present stages. A problem which was involved in physics and mathematics in I 7” century led to a branch of mathematics called calculus of variation which was used in economic, and management at the end of the first quarter of the 20” ...

متن کامل

The Zero Exemplar Distance Problem

Given two genomes with duplicate genes, Zero Exemplar Distance is the problem of deciding whether the two genomes can be reduced to the same genome without duplicate genes by deleting all but one copy of each gene in each genome. Blin, Fertin, Sikora, and Vialette recently proved that Zero Exemplar Distance for monochromosomal genomes is NP-hard even if each gene appears at most two times in ea...

متن کامل

Problem 1 : Zero Knowledge Proof

a. To check that the graph is represented correctly, Bob asks Alice to remove all the paper cups covering the endpoints of every edge. This reveals an isomorphism to the original graph, which Bob cannot check efficiently; thus, Bob also removes the paper cups corresponding to the green numbers, revealing the original labelling of the vertices. This reveals nothing about the vertex cover, but al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kyushu Journal of Mathematics

سال: 2007

ISSN: 1340-6116

DOI: 10.2206/kyushujm.61.155